Entropy on discrete abelian groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Filter Banks on Discrete Abelian Groups

In this work we provide polyphase, modulation, and frame theoretical analyses of a filter bank on a discrete abelian group. Thus, multidimensional or cyclic filter banks as well as filter banks for signals in `(Z×Zs) or `(Zr ×Zs) spaces are studied in a unified way. We obtain perfect reconstruction conditions and the corresponding frame bounds.

متن کامل

C*-algebras on r-discrete Abelian Groupoids

We study certain function algebras and their operator algebra completions on r-discrete abelian groupoids, the corresponding conditional expectations, maximal abelian subalgebras (masa) and eigen-functionals. We give a semidirect product decomposition for an abelian groupoid. This is done through a matched pair and leads to a C*-diagonal (for a special case). We use this decomposition to study ...

متن کامل

Endomorphisms of Compact Abelian Groups Minimize Entropy

The entropy conjecture for tori has been settled a long time ago by Misiurewicz and Przytycki. We show that their result extends from tori to compact and connected abelian groups. We give stronger results for hyperbolic automorphisms. Throughout this paper G denotes a compact and connected metric abelian group. The group operation on G is written additively.

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Weak discrete logarithms in non-abelian groups

The intractability of the traditional discrete logarithm problem (DLP) forms the basis for the design of numerous cryptographic primitives. In [2] M. Sramka et al. generalize the DLP to arbitrary finite groups. One of the reasons mentioned for this generalization is P. Shor’s quantum algorithm [4] which solves efficiently the traditional DLP. The DLP for a nonabelian group is based on a particu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 1979

ISSN: 0001-8708

DOI: 10.1016/s0001-8708(79)80007-9